Generalized Group Testing
نویسندگان
چکیده
In the problem of classical group testing one aims to identify a small subset (of size $d$ ) diseased individuals/defective items in large population notation="LaTeX">$n$ ). This process is based on minimal number suitably-designed tests subsets items, where test outcome positive iff given contains at least defective item. Motivated by physical considerations, such as scenarios with imperfect apparatus, we consider generalized setting that includes special cases multiple other group-testing-like models literature. our governed an arbitrary monotonically increasing (stochastic) function notation="LaTeX">$f(\cdot)$ , being probability notation="LaTeX">$f(x)$ notation="LaTeX">$x$ defectives tested pool. formulation subsumes variety noiseless and noisy group-testing Our main contributions are follows. Firstly, for any monotone present non-adaptive scheme notation="LaTeX">$1-\varepsilon $ identifies all items. requires most notation="LaTeX">${\mathcal{ O}}\left ({{\Psi (f)} d\log \left ({\frac {n}{\varepsilon }}\right)}\right)$ tests, notation="LaTeX">${\Psi (f)}$ suitably defined “sensitivity parameter” never larger than O}}(d^{1+o(1)})$ but indeed can be substantially smaller . Secondly, argue needs notation="LaTeX">$\Omega ({(1-\varepsilon) {\psi {n} d}\right)}\right)$ ensure high reliability recovery. Here notation="LaTeX">${\psi “concentration (f)}\in \Omega {(1)}$ Thirdly, prove sample-complexity bounds information-theoretically near-optimal sparse-recovery That is, xmlns:xlink="http://www.w3.org/1999/xlink">any “noisy” (i.e., notation="LaTeX">$0 < f(0) f(d) 1$ ), “(one-sided) noiseless” functions either notation="LaTeX">$f(0)=0$ or notation="LaTeX">$f(d)=1$ both) studied literature show notation="LaTeX">$\frac {\Psi \in \Theta (1)$ As by-product tightly characterize heretofore open information-theoretic order-wise well-studied model threshold group-testing. For general (near)-noiseless {\mathcal{ We also demonstrate “natural” test-function whose sample complexity scales “extremally” notation="LaTeX">$\Theta (d^{2}\log n)$ rather (d\log case Some techniques may independent interest – particular achievability delicate saddle-point approximation, impossibility proof relies novel bound relating mutual information pair random variables mean variance specific function, showing upper lower close derive structural results about functions.
منابع مشابه
Generalized Framework for Selectors with Applications in Optimal Group Testing
Group Testing refers to the situation in which one is given a set of objects O, an unknown subset P O, and the task is to determine P by asking queries of the type \does P intersect Q?", where Q is a subset of O. Group testing is a basic search paradigm that occurs in a variety of situations such as quality control in product testing, searching in storage systems, multiple access communications...
متن کاملGroup rings satisfying generalized Engel conditions
Let R be a commutative ring with unity of characteristic r≥0 and G be a locally finite group. For each x and y in the group ring RG define [x,y]=xy-yx and inductively via [x ,_( n+1) y]=[[x ,_( n) y] , y]. In this paper we show that necessary and sufficient conditions for RG to satisfies [x^m(x,y) ,_( n(x,y)) y]=0 is: 1) if r is a power of a prime p, then G is a locally nilpotent group an...
متن کاملGENERALIZED GORENSTEIN DIMENSION OVER GROUP RINGS
Let $(R, m)$ be a commutative noetherian local ring and let $Gamma$ be a finite group. It is proved that if $R$ admits a dualizing module, then the group ring $Rga$ has a dualizing bimodule as well. Moreover, it is shown that a finitely generated $Rga$-module $M$ has generalized Gorenstein dimension zero if and only if it has generalized Gorenstein dimension zero as an $R$-module.
متن کاملTesting Generalized Lorenz Dominance
It is well known that the property of generalized Lorenz dominance (GLD) between two distributions is a scaled Lorenz dominance, where the scale factor is the ratio of the two finite positive means. It is convenient to test the GLD property between any pair of distributions because, the property is equivalent to the so-called second order stochastic dominance (SSD), whose statistical tests may ...
متن کاملEfficient Decodable Group Testing
The basic group testing problem is to identify the unknown set of " positive items " from a large population of " items " using as few " tests " as possible. A test is a subset of items. A test returns positive if there is a positive item in the subset. The semantics of " positives, " " items, " and " tests " depend on the application. In the original context [3], group testing was invented to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2023
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2022.3218174